Parallel branch and bound algorithm for computing maximal structured singular value
نویسندگان
چکیده
منابع مشابه
M ay 2 00 8 Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value ∗
In this paper, we have developed a parallel branch and bound algorithm which computes the maximal structured singular value μ without tightly bounding μ for each frequency and thus significantly reduce the computational complexity.
متن کاملDistributed Computing with Hierarchical Master-worker Paradigm for Parallel Branch and Bound Algorithm
This paper discusses the impact of the hierarchical master-worker paradigm on performance of an application program, which solves an optimization problem by a parallel branch and bound algorithm on a distributed computing system. The application program, which this paper addresses, solves the BMI Eigenvalue Problem, which is an optimization problem to minimize the greatest eigenvalue of a bilin...
متن کاملA Parallel Branch-and-Bound Algorithm for Computing Optimal Task Graph Schedules
In order to harness the power of parallel computing we must firstly find appropriate algorithms that consist of a collection of (sub)tasks and secondly schedule these tasks to processing elements that communicate data between each other by means of a network. In this paper, we consider task graphs that take into account both, computation and communication costs. For a homogeneous computing syst...
متن کاملChapter 5 PARALLEL ALGORITHM DESIGN FOR BRANCH AND BOUND
Large and/or computationally expensive optimization problems sometimes require parallel or high-performance computing systems to achieve reasonable running times. This chapter gives an introduction to parallel computing for those familiar with serial optimization. We present techniques to assist the porting of serial optimization codes to parallel systems and discuss more fundamentally parallel...
متن کاملA Branch-and-bound Algorithm for Parallel Machine Scheduling Problems
In this paper, a Branch-and-Bound (B&B) algorithm is presented to solve the problem of minimizing the maximum completion time Cmax on unrelated parallel machines with machine eligibility restrictions when job preemption is not allowed. A customized lower bound, a search and a branching strategy are developed for the B&B. A machine eligibility factor is also introduced to represent the percentag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEE Proceedings - Control Theory and Applications
سال: 2003
ISSN: 1350-2379,1359-7035
DOI: 10.1049/ip-cta:20030632